ERRATUM to: Double domination edge removal critical graphs

نویسندگان

  • Soufiane Khelifi
  • Mostafa Blidia
  • Mustapha Chellali
  • Frédéric Maffray
چکیده

In Section 5 of [1], class H2 should be defined as follows: Let H2 be the family of graphs whose vertex set contains a set D that induces a star K1,r (with r ≥ 1), of center vertex x and leaves x1, . . . , xr, such that: for every vertex u of V (G) − D, N(u) is equal to either {x1, x2} or {x, xi} for some i ∈ {1, . . . , r}; moreover, if any vertex z of V (G)−D satisfies N(z) = {x1, x2}, then no vertex u of V (G) − D satisfies N(u) = {x, x1}. In [1] the proof of Theorem 18 (p. 298, line 4), the clause “all remaining vertices of V (G) − D are either xl, xl′ or to x, xl” must be replaced by: then we may assume, up to symmetry, that no vertex u of V (G) − D satisfies N(u) = {x, xl′}.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Double domination edge removal critical graphs

In a graph, a vertex is said to dominate itself and all its neighbors. A double dominating set of a graph G is a subset of vertices that dominates every vertex of G at least twice. The double domination number γ×2(G) is the minimum cardinality of a double dominating set of G. A graph G without isolated vertices is called edge removal critical with respect to double domination, or just γ×2-criti...

متن کامل

Majority Domination Edge Critical Graphs

This paper deals the graphs for which the removal of any edge changes the majority domination number of the graph. γM -critical edges, γM -redundant edges, γM -durable graphs and γM -critical graphs are studied. Further, majority domination critical edges and majority domination critical graphs are characterized.

متن کامل

Double domination stable graphs upon edge removal

In a graph G = (V (G), E(G)), a vertex dominates itself and its neighbors. A subset S of V (G) is a double dominating set if every vertex of V (G) is dominated at least twice by the vertices of S. The double domination number of G is the minimum cardinality among all double dominating sets of G. We consider the effects of edge removal on the double domination number of a graph. We give a necess...

متن کامل

Erratum to: Some Graphs with Double Domination Subdivision Number Three

A subset S ⊆ V (G) is a double dominating set of G if S dominates every vertex of G at least twice. The double domination number dd(G) is the minimum cardinality of a double dominating set of G. The double domination subdivision number sddd(G) is the minimum number of edges that must be subdivided (where each edge in G can be subdivided at most once) in order to increase the double domination n...

متن کامل

Bicritical domination and duality coalescence of graphs

A graph is bicritical if the removal of any pair of vertices decreases the domination number. We study properties of bicritical graphs and their relation with critical graphs. Next we obtain results for bicritical graphs with edge connectivity two or three. We also generalize the notion of the coalescence of two graphs, and we investigate the bicriticality of such graphs.

متن کامل

On the signed Roman edge k-domination in graphs

Let $kgeq 1$ be an integer, and $G=(V,E)$ be a finite and simplegraph. The closed neighborhood $N_G[e]$ of an edge $e$ in a graph$G$ is the set consisting of $e$ and all edges having a commonend-vertex with $e$. A signed Roman edge $k$-dominating function(SREkDF) on a graph $G$ is a function $f:E rightarrow{-1,1,2}$ satisfying the conditions that (i) for every edge $e$of $G$, $sum _{xin N[e]} f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Australasian J. Combinatorics

دوره 55  شماره 

صفحات  -

تاریخ انتشار 2013